On the distance domination number of bipartite graphs
نویسندگان
چکیده
منابع مشابه
On the super domination number of graphs
The open neighborhood of a vertex $v$ of a graph $G$ is the set $N(v)$ consisting of all vertices adjacent to $v$ in $G$. For $Dsubseteq V(G)$, we define $overline{D}=V(G)setminus D$. A set $Dsubseteq V(G)$ is called a super dominating set of $G$ if for every vertex $uin overline{D}$, there exists $vin D$ such that $N(v)cap overline{D}={u}$. The super domination number of $G$ is the minimum car...
متن کاملDomination and Signed Domination Number of Cayley Graphs
In this paper, we investigate domination number as well as signed domination numbers of Cay(G : S) for all cyclic group G of order n, where n in {p^m; pq} and S = { a^i : i in B(1; n)}. We also introduce some families of connected regular graphs gamma such that gamma_S(Gamma) in {2,3,4,5 }.
متن کاملDomination in bipartite graphs
The domination number γ(G) of a (finite, undirected and simple) graph G = (V,E) is the minimum cardinality of a set D ⊆ V of vertices such that every vertex in V \ D has a neighbour in D. This parameter is one of the most well-studied in graph theory and the two volume monograph [9, 10] provides an impressive account of the research related to this concept. Fundamental results about the dominat...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کامل2-domination in Bipartite Graphs with Odd Independence Number
For a positive integer k, a set of vertices S in a graph G is said to be a k-dominating set if each vertex x in V (G) − S has at least k neighbors in S. The cardinality of a smallest k-dominating set of G is called the k-domination number of G and is denoted by γk(G). The independence number of a graph G is denoted by α(G). In [Australas. J. Combin. 40 (2008), 265–268], Fujisawa, Hansberg, Kubo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Graph Theory and Applications
سال: 2020
ISSN: 2338-2287
DOI: 10.5614/ejgta.2020.8.2.11